Residuation theory and Boolean matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean Matrices . . . Neither Boolean nor Matrices

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we “show” that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A...

متن کامل

Aggregation and Residuation

In this note we give a characterization of meet-projections in simple atomistic lattices that generalizes results on the aggregation of partitions in cluster analysis. Documents de Travail du Centre d'Economie de la Sorbonne 2010.58 1 AGGREGATION and RESIDUATION Bruno LECLERC 1 and Bernard MONJARDET 2 Abstract In this note we give a characterization of meet-projections in simple atomistic latti...

متن کامل

Automata, Boolean Matrices, and Ultimate Periodicity

This paper presents a Boolean-matrix-based method to automata theory, with an application to the study of regularity-preserving functions. A new characterization of such functions is derived in terms of the property of ultimate periodicity with respect to powers of Boolean matrices. This characterization reveals the intrinsic algebraic nature of regularity-preserving functions. It facilitates a...

متن کامل

Path homomorphisms, graph colorings, and boolean matrices

We investigate bounds on the chromatic number of a graph G derived from the nonexistence of homomorphisms from some path ~ P into some orientation ~ G of G. The condition is often efficiently verifiable using boolean matrix multiplications. However, the bound associated to a path ~ P depends on the relation between the “algebraic length” and “derived algebraic length” of ~ P . This suggests tha...

متن کامل

Cryptographic Boolean functions via group Hadamard matrices

For any integers n m n m n we construct a set of boolean functions on Vm say ff z fn z g which has the following important cryptographic properties i any nonzero linear combination of the functions is balanced ii the nonlinearity of any nonzero linear combination of the functions is at least m n iii any nonzero linear combination of the functions satis es the strict avalanche cri terion iv the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Glasgow Mathematical Association

سال: 1964

ISSN: 2040-6185,2051-2104

DOI: 10.1017/s2040618500034997